-
1 finitely axiomatizable system
Математика: конечно аксиоматизируемая системаУниверсальный англо-русский словарь > finitely axiomatizable system
-
2 finitely axiomatizable system
English-Russian scientific dictionary > finitely axiomatizable system
-
3 finitely
конечно-дифференцирующий almost finitely generated module ≈ почти конечно порожденный модуль almost finitely related module ≈ почти конечно связанный модуль finitely additive function ≈ конечно аддитивная функция finitely additive measure ≈ конечно аддитивная мера finitely approximable group ≈ конечно аппроксимируемая группа finitely approximable semigroup ≈ финитно аппроксимируемая полугруппа finitely approximated system ≈ конечно аппроксимированная система finitely axiomatizable class ≈ конечно аксиоматизируемый класс finitely axiomatizable quasivariety ≈ конечно аксиоматизируемое квазимногообразие finitely axiomatizable system ≈ конечно аксиоматизируемая система finitely axiomatizable theor ≈ конечно аксиоматизируемая теория finitely axiomatizable variety ≈ конечно аксиоматизируемое многообразие finitely basable manifold ≈ конечно базируемое многообразие finitely bounded germ ≈ конечно ограниченный росток finitely cogenerated group ≈ конечно копорожденная группа finitely compact manifold ≈ конечно компактное многообразие finitely compact set ≈ конечно компактное множество finitely compact space ≈ конечно компактное пространство finitely connected domain ≈ конечносвязная область finitely connected module ≈ конечно связный модуль finitely connected subset ≈ конечно связное подмножество finitely convergent element ≈ конечно сходящийся элемент finitely convergent semigroup ≈ конечно сходящаяся полугруппа finitely definable quasivariety ≈ конечно определимое квазимногообразие finitely definable variety ≈ конечно определимое многообразие finitely defined algebra ≈ конечно определенная алгебра finitely defined group ≈ конечно определенная группа finitely definite set ≈ конечно определенное множество finitely differentiable equation ≈ конечно-дифференцируемое уравнение finitely generated algebra ≈ конечно порожденная алгебра finitely generated extension ≈ конечно порожденное расширение finitely generated field ≈ конечно порожденное поле finitely generated group ≈ матем. группа с конечным числом образующих finitely generated model ≈ конечно порожденная модель finitely generated monoid ≈ конечно порожденный моноид finitely generated presentation ≈ конечно порожденное представление finitely generated representation ≈ конечно порожденное пространство finitely generated ring ≈ конечно порожденное кольцо finitely generated semigroup ≈ конечно порожденная полугруппа finitely generated sheaf ≈ пучок с конечным числом образующих finitely generated structure ≈ конечно порожденная структура finitely generated subgroup ≈ конечно порожденная подгруппа finitely generated submodule ≈ конечно порожденный подмодуль finitely generated subobject ≈ конечно порожденный подобъект finitely generating ideal ≈ конечно порожденный идеал finitely mean valent function ≈ конечнолистная в среднем функция finitely measurable function ≈ конечно измеримая функция finitely measurable set ≈ конечно измеримое множество finitely presented group ≈ конечно представимая группа finitely presented module ≈ конечно представимый модуль finitely presented semigroup ≈ конечно определенная полугруппа finitely presented system ≈ конечно представленная система finitely productive space ≈ конечно продуктивное пространство finitely related group ≈ группа с конечным числом отношений finitely related presentation ≈ представление с конечным числом соотношений finitely related representation ≈ представление с конечным числом определяющих соотошений finitely sheeted domain ≈ конечнолистная область finitely sheeted space ≈ конечнолистное пространство finitely spanned module ≈ матем. модуль конечнопорожденный finitely triangulated manifold ≈ конечно триангулированное многообразие finitely triangulated space ≈ конечно триангулированное пространство finitely triangulated triad ≈ конечно триангулированная триада finitely valued function ≈ конечнозначная функция finitely valued random variable ≈ конечнозначная случайная величина purely finitely additive ≈ вполне конечно аддитивный - at most finitely many - finitely additive - finitely approximable - finitely axiomatized - finitely branched - finitely cogenerated - finitely compact - finitely connected - finitely covered - finitely definable - finitely defined - finitely dependent - finitely differentiable - finitely distributive - finitely generated - finitely invariant - finitely measurable - finitely open - finitely presented - finitely productive - finitely related - finitely satisfiable - finitely sheeted - finitely subadditive - finitely valued FinitelyБольшой англо-русский и русско-английский словарь > finitely
-
4 axiomatizable
аксиоматизируемый finitely axiomatizable class ≈ конечно аксиоматизируемый класс finitely axiomatizable quasivariety ≈ конечно аксиоматизируемое квазимногообразие finitely axiomatizable system ≈ конечно аксиоматизируемая система finitely axiomatizable theor ≈ конечно аксиоматизируемая теория finitely axiomatizable variety ≈ конечно аксиоматизируемое многообразие recursively axiomatizable theor ≈ рекурсивно аксиоматизируемая теория universally axiomatizable class ≈ универсально аксиоматизируемый класс universally axiomatizable subclass ≈ универсально аксиоматизируемый подкласс - axiomatizable class - axiomatizable system - axiomatizable theor - axiomatizable typeБольшой англо-русский и русско-английский словарь > axiomatizable
-
5 system
1) система; комплекс2) совокупность•- absolutely consistent system - absolutely direct indecomposable system - absolutely free system - absolutely irreducible system - absolutely isolated system - allowable coordinate system - almost linear system - ample linear system - artificial feel system - automatic block system - automatic deicing system - binary relational system - binary-coded decimal system - block tooling system - Cartesian coordinate system - completely controllable system - completely ergodic system - completely hyperbolic system - completely identifiable system - completely integrable system - completely irreducible system - completely regular system - completely stable system - completely stratified system - complex number system - conical coordinate system - derivational formal system - differential equation system - differential selsyn system - digital counting system - digital transmission system - elliptic coordinate system - elliptic cylindrical coordinate system - externally inconsistent system - finite state system - finitely axiomatizable system - finitely presented system - fully characteristic quotient system - fundamental system of solutions - hydraulic lift system - integrated switching system - isomorphically embedded system - kernel normal system - linearly dependent system - linearly independent system - live hydraulic system - locking protection system - meteor-burst communication system - modular programming system - parabolic cylindrical coordinate system - permanent four-wheel drive system - pure independent system - radio telephone system - reactor protection system - real number system - receiver-amplifier crioelectric system - remote-cylinder hydraulic system - semantically consistent system - simply consistent system - simply incomplete system - simply ordered system - spherical coordinate system - strongly multiplicative system - structurally stable system - sufficiently general coordinate system - system of frequency curves - system of rational numbers - time multiplex system - time-division multiplex system - uniformly complete system - univalent system of notation - universal system of notation - weakly closed system - weighted number system -
6 конечно аксиоматизируемая система
Mathematics: finitely axiomatizable system, finitizable systemУниверсальный русско-английский словарь > конечно аксиоматизируемая система
-
7 конечно аксиоматизируемая система
finitizable system мат., finitely axiomatizable systemРусско-английский научно-технический словарь Масловского > конечно аксиоматизируемая система
См. также в других словарях:
Foundations of mathematics — is a term sometimes used for certain fields of mathematics, such as mathematical logic, axiomatic set theory, proof theory, model theory, and recursion theory. The search for foundations of mathematics is also a central question of the philosophy … Wikipedia
Certainty — series Agnosticism Belief Certainty Doubt Determinism Epistemology Estimation Fallibilism … Wikipedia
logic, history of — Introduction the history of the discipline from its origins among the ancient Greeks to the present time. Origins of logic in the West Precursors of ancient logic There was a medieval tradition according to which the Greek philosopher … Universalium
Relation algebra — is different from relational algebra, a framework developed by Edgar Codd in 1970 for relational databases. In mathematics, a relation algebra is a residuated Boolean algebra supporting an involutary unary operation called converse. The… … Wikipedia
ω-consistent theory — In mathematical logic, an ω consistent (or omega consistent, also called numerically segregative[1]) theory is a theory (collection of sentences) that is not only (syntactically) consistent (that is, does not prove a contradiction), but also… … Wikipedia
Ω-consistent theory — In mathematical logic, an ω consistent (or omega consistent, also called numerically segregativeW.V.O. Quine, Set Theory and its Logic ] ) theory is a theory (collection of sentences) that is not only (syntactically) consistent (that is, does not … Wikipedia
Boolean algebra — This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… … Wikipedia
Boolean algebra (introduction) — Boolean algebra, developed in 1854 by George Boole in his book An Investigation of the Laws of Thought , is a variant of ordinary algebra as taught in high school. Boolean algebra differs from ordinary algebra in three ways: in the values that… … Wikipedia
Admissible rule — In logic, a rule of inference is admissible in a formal system if the set of theorems of the system is closed under the rule. The concept of an admissible rule was introduced by Paul Lorenzen (1955).DefinitionsThe concept of admissibility, as… … Wikipedia
Zermelo–Fraenkel set theory — Zermelo–Fraenkel set theory, with the axiom of choice, commonly abbreviated ZFC, is the standard form of axiomatic set theory and as such is the most common foundation of mathematics.ZFC consists of a single primitive ontological notion, that of… … Wikipedia
Decidability (logic) — In logic, the term decidable refers to the decision problem, the question of the existence of an effective method for determining membership in a set of formulas. Logical systems such as propositional logic are decidable if membership in their… … Wikipedia